Formalizing Domains, Ultrametric Spaces and Semantics of Programming Languages

نویسندگان

  • NICK BENTON
  • LARS BIRKEDAL
  • ANDREW KENNEDY
چکیده

We describe a Coq formalization of constructive ω-cpos, ultrametric spaces and ultrametric-enriched categories, up to and including the inverse-limit construction of solutions to mixed-variance recursive equations in both categories enriched over ω-cppos and categories enriched over ultrametric spaces. We show how these mathematical structures may be used in formalizing semantics for three representative programming languages. Specifically, we give operational and denotational semantics for both a simply-typed CBV language with recursion and an untyped CBV language, establishing soundness and adequacy results in each case, and then use a Kripke logical relation over a recursively-defined metric space of worlds to give an interpretation of types over a step-counting operational semantics for a language with recursive types and general references.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Characterization of Distance between 1-Bounded Compact Ultrametric Spaces through a Universal Space

The category of 1-bounded compact ultrametric spaces and non-distance increasing functions (KUM’s) have been extensively used in the semantics of concurrent programming languages. In this paper a universal space U for KUM’s is introduced, such that each KUM can be isometrically embedded in it. U consists of a suitable subset of the space of functions from [0, 1) to IN, endowed with a “prefix-ba...

متن کامل

Ultrametric Domain Theory and Semantics in Coq

We present a Coq formalization of ultrametric spaces and of ultrametric-enriched categories, up to and including the construction of solutions to recursive domain equations in ultrametric-enriched categories. We then show how to apply this semantic setup for giving semantics to a programming language with higher-order store. Specifically, we define a step counting operational semantics for a fu...

متن کامل

The Fixed - Point Theorems of

Sibylla Priess-Crampe and Paulo Ribenboim recently established a general xed-point theorem for multivalued mappings deened on generalized ultrametric spaces, and introduced it to the area of logic programming semantics. We discuss, in this context, the applications which have been made so far of this theorem and of its corollaries. In particular, we will relate these results to Scott-Ershov dom...

متن کامل

A Characterization of Distance Between 1-Bounded Compact Ultrametic Spaces Through a Universal Space

The category of 1-bounded compact ultrametric spaces and non-distance increasing functions (KUM's) have been extensively used in the semantics of concurrent programming languages. In this paper a universal space U for KUM's is introduced, such that each KUM can be isomet-rically embedded in it. U consists of a suitable subset of the space of functions from 0; 1) to IN, endowed with a \preex-bas...

متن کامل

The Fixed-point Theorems of Priess-crampe and Ribenboim in Logic Programming

Sibylla Priess-Crampe and Paulo Ribenboim recently established a general xed-point theorem for multivalued mappings deened on generalized ultrametric spaces, and introduced it to the area of logic programming semantics. We discuss, in this context, the applications which have been made so far of this theorem and of its corollaries. In particular, we will relate these results to Scott-Ershov dom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010